Free energy and some sample path properties of a random walk with random potential

We study the asymptotic behavior of the free energy for a model (defined by Sinai) of one-dimensional random walk with random potential. In particular, we obtain a central limit theorem and a strong law of large numbers for this free energy. We use some results on the free energy to study some sample path properties of this random walk which are related respectively to its recurrence and localization. Some exponents describing the recurrence and localization are found.     

Area Distribution for Directed Random Walks

We study the probability distribution for the area under a directed random walk in the plane. The walk can serve as a simple model for avalanches based on the idea that the front of an avalanche can be described by a random walk and the size is given by the area enclosed. This model captures some of the qualitative features of earthquakes, avalanches, and other self-organized critical phenomena in one dimension. By finding nonlinear functional relations for the generating functions we calculate directly the exponent in the size distribution law and find it to be 4/3.     

THE DIMENSIONS OF THE RANGE OF RANDOM WALKS IN TIME-RANDOM ENVIRONMENTS

Suppose {Xn} is a random walk in time-random environment with state space Zd,|Xn| approaches infinity, then under some reasonable conditions of stability, the upper bound of the discrete Packing dimension of the range of {Xn} is any stability index a. Moreover, if the environment is stationary, a similar result for the lower bound of the discrete Hausdorff dimension is derived. Thus, the range is a fractal set for almost every environment.     

独立渐进随机环境中随机行走

讨论了一类独立但不一定同分布随机环境中随机行走的常返性和非常返性，进而研究了常返性中的正常返，以及在它们基础上逃逸速度的极限性质，从而推广了Solmn的理论框架。     

Advection and dispersion in time and space

Previous work showed how moving particles that rest along their trajectory lead to time-nonlocal advection–dispersion equations. If the waiting times have infinite mean, the model equation contains a fractional time derivative of order between 0 and 1. In this article, we develop a new advection–dispersion equation with an additional fractional time derivative of order between 1 and 2. Solutions to the equation are obtained by subordination. The form of the time derivative is related to the probability distribution of particle waiting times and the subordinator is given as the first passage time density of the waiting time process which is computed explicitly.     

The number of smallest knots on the cubic lattice

It has been shown that the smallest knots on the cubic lattice are all trefoils of length 24. In this paper, we show that the number of such unrooted knots on the cubic lattice is 3496.     

Super-Tree Random Measures

We use supercritical branching processes with random walk steps of geometrically decreasing size to construct random measures. Special cases of our construction give close relatives of the super-(spherically symmetric stable) processes. However, other cases can produce measures with very smooth densities in any dimension.     

On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I

A simple and quite general approach is proposed to derive criteria for transience and ergodicity of a certain class of irreducibleN-dimensional Markov chains in ₊ ^N assuming a boundedness condition on the second moment of the jumps. The method consists in constructing convenient smooth supermartingales outside some compact set. The Lyapounov functions introduced belong to the set of quadratic forms in ₊ ^N and do not always have a definite sign. Existence and construction of these forms is shown to be basically equivalent to finding vectors satisfying a system of linear inequalities.Part I is restricted toN=2, in which case a complete characterization is obtained for the type of random walks analyzed by Malyshev and Mensikov, thus relaxing their condition of boundedness of the jumps. The motivation for this work is partly from a large class of queueing systems that give rise to random walks in ₊ ^N      

On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

Exact solutions and symmetry analysis for the limiting probability distribution of quantum walks

In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a general coin or swapping shift operator. In this paper, we derive exact solutions for the limiting probability distribution of quantum walks using a general coin and swapping shift operator on cycles for the first time. Based on the exact solutions, we show how to generate symmetric quantum walks and determine the condition under which a symmetric quantum walk appears. Our results suggest that choosing various coin and initial state parameters can achieve a symmetric quantum walk. By defining a quantity to measure the variation of symmetry, deviation and mixing time of symmetric quantum walks are also investigated.